Delay performance in random-access grid networks
نویسندگان
چکیده
منابع مشابه
Delay performance in random-access grid networks
We examine the impact of torpid mixing and meta-stability issues on the delay performance in wireless random-access networks. Focusing on regular meshes as prototypical scenarios, we show that the mean delays in an L×L toric grid with normalized load ρ are of the order ( 1 1−ρ ). This superlinear delay scaling is to be contrasted with the usual linear growth of the order 1 1−ρ in conventional q...
متن کاملDelay Performance and Mixing Times in Random-Access Networks
We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed queue-based randomaccess schemes provide the striking capability to match the optimal throughput performance of centralized scheduling mechanisms in a wide range of scenarios. The specific type of activation rules for which throughput op...
متن کاملDelay-constrained utility maximisation in multi-hop random access networks
Multi-hop random access networks have received much attention due to their distributed nature which facilitates deploying many new applications over the sensor and computer networks. Recently, utility maximization framework is applied in order to optimize performance of such networks, however proposed algorithms result in large transmission delays. In this paper, we will analyze delay in random...
متن کاملDelay-Constrained Utility Maximization in Multihop Random Access Networks
Multi-hop random access networks have received much attention due to their distributed nature which facilitates deploying many new applications over the sensor and computer networks. Recently, utility maximization framework is applied in order to optimize performance of such networks however delay is not limited and proposed algorithms result in very large transmission delays. In this paper, we...
متن کاملAdaptive random access algorithm with improved delay performance
We propose an adaptive random access algorithm for mobile environments with capture. The algorithm has a dynamic window size which is updated according to the tra$c intensity. The packet arrival rate is tracked by employing sequential detection procedures. Simulations indicate that reducing the window size adaptively under heavy load conditions improves the average delay signi"cantly. Copyright...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 2013
ISSN: 0166-5316
DOI: 10.1016/j.peva.2013.08.019